color stack - translation to ρωσικά
Display virtual keyboard interface

color stack - translation to ρωσικά

TREE DATA STRUCTURE IN WHICH EACH NODE HAS A POINTER TO ITS PARENT NODE
Cactus stack; Saguaro stack; Spaghetti stack

color stack      
многоярусная компоновка красочных секций
kekur         
GEOLOGICAL LANDFORM CONSISTING OF A STEEP AND OFTEN VERTICAL COLUMN OR COLUMNS OF ROCK
Stack (Geology); Sea stack; Sea Stack; Sea-stack; Seastack; Raukar; Kekur; Kekurs; Sea stacks

color="gray">общая лексика

кекур

callstack         
  • green}}), which is the currently executing routine
STACK DATA STRUCTURE THAT STORES INFORMATION ABOUT THE ACTIVE SUBROUTINES OF A COMPUTER PROGRAM
Stack pointer; Stack frame; Frame pointer; Activation record; Stack unwinding; Function stack; Call Stack; Run-time stack; Control stack; Process stack; Runtime stack; Framepointer; Callstack; CallStack; Call frame; Call chain; Display register; Access link; Mark pointer; Return pointer; Callstacks; Activation frame; Outgoing arguments area; Callout area; Call stack inspection; Call Frame Information; Stack pointe

color="gray">общая лексика

стек вложенных подпрограмм, стек вызовов

Βικιπαίδεια

Parent pointer tree

In computer science, an in-tree or parent pointer tree is an N-ary tree data structure in which each node has a pointer to its parent node, but no pointers to child nodes. When used to implement a set of stacks, the structure is called a spaghetti stack, cactus stack or sahuaro stack (after the sahuaro, a kind of cactus). Parent pointer trees are also used as disjoint-set data structures.

The structure can be regarded as a set of singly linked lists that share part of their structure, in particular, their tails. From any node, one can traverse to ancestors of the node, but not to any other node.

Μετάφραση του &#39color stack&#39 σε Ρωσικά